The equivalence problem for deterministic two-tape automata
نویسندگان
چکیده
منابع مشابه
The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata
A deterministic pushdown automaton (dpda) is described as finite-turn if there is a bound on the number of times the direction of the stack movement can change in the set of all derivations from the starting configuration. The purpose of this paper is to show that there exists a procedure for deciding whether two such finite-turn machines recognize the same language. By virtue of a direct corre...
متن کاملThe Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape
Complexity in Convex Languages p. 1 Three Learnable Models for the Description of Language p. 16 Arbology: Trees and Pushdown Automata p. 32 Analysis of Communicating Automata p. 50 Regular Papers Complexity of the Satisfiability Problem for a Class of Propositional Schemata p. 58 A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton p. 70 A Fast Longest Common Subsequence A...
متن کاملTwo-Way Two-Tape Automata
In this article we consider two-way two-tape (alternating) automata accepting pairs of words and we study some closure properties of this model. Our main result is that such alternating automata are not closed under complementation for non-unary alphabets. This improves a similar result of Kari and Moore for picture languages. We also show that these deterministic, non-deterministic and alterna...
متن کاملOn the Representation of Finite Deterministic 2-Tape Automata
This paper presents properties of relations between words that are realized by deterministic nite 2-tape automata. It has been made as complete as possible, and is structured by the systematic use of the matrix representation of automata. It is rst shown that deterministic 2-tape automata are characterized as those which can be given a preex matrix representation. Sch utzenberger construct on r...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1973
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(73)80045-5